Practical IBC using Hybrid-Mode Problems: Factoring and Discrete Logarithm
نویسندگان
چکیده
منابع مشابه
Factoring and Discrete Logarithm using IBC
In 1984, Shamir proposed the concept of the ID-based cryptosystem (IBC). Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large public key file is not required. ...
متن کاملA Factoring and Discrete Logarithm based Cryptosystem
This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...
متن کاملFusion Discrete Logarithm Problems
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of candidate algebraic structures which permit implementing the algorithms. In order to extend the applicability of discrete-logarithm-based cryptosystems to a much ri...
متن کاملAn Efficient Signature Scheme based on Factoring and Discrete Logarithm
This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme wit...
متن کاملA New Signature Scheme Based on Factoring and Discrete Logarithm Problems
Received 06 th June, 2012 Revised 12 th July, 2012 Accepted, 25 th July2012 In 1994, He and Kiesler proposed a digital signature scheme which was based on the factoring and the discrete logarithm problem both. Same year, Shimin-Wei modified the He-Kiesler signature scheme. In this paper, we propose an improvement of Shimin-Wei signature scheme based on factorization and discrete logarithm probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Electrical Engineering and Informatics
سال: 2015
ISSN: 2302-9285,2089-3191
DOI: 10.11591/eei.v4i1.326